Topic Continuity for Web Document Categorization and Ranking
نویسندگان
چکیده
PageRank is primarily based on link structure analysis. Recently, it has been shown that content information can be utilized to improve link analysis. We propose a novel algorithm that harnesses the information contained in the history of a surfer to determine his topic of interest when he is on a given page. As the history is unavailable until query time, we guess it probabilistically so that the operations can be performed offline. This leads to a better web page categorization and, thereby, to a better ranking of web pages.
منابع مشابه
RRLUFF: Ranking function based on Reinforcement Learning using User Feedback and Web Document Features
Principal aim of a search engine is to provide the sorted results according to user’s requirements. To achieve this aim, it employs ranking methods to rank the web documents based on their significance and relevance to user query. The novelty of this paper is to provide user feedback-based ranking algorithm using reinforcement learning. The proposed algorithm is called RRLUFF, in which the rank...
متن کاملAn Ensemble Click Model for Web Document Ranking
Annually, web search engine providers spend more and more money on documents ranking in search engines result pages (SERP). Click models provide advantageous information for ranking documents in SERPs through modeling interactions among users and search engines. Here, three modules are employed to create a hybrid click model; the first module is a PGM-based click model, the second module in a d...
متن کاملRanking Classes of Search Engine Results
Ranking search results is an ongoing research topic in information retrieval. The traditional models are the vector space, probabilistic and language models, and more recently machine learning has been deployed in an effort to learn how to rank search results. Categorization of search results has also been studied as a means to organize the results, and hence to improve users search experience....
متن کاملInnovative Personalized Architecture in Case of Web Search Users
Web search engines provide users with a Large number of results for a submitted query. However, not all return results are relevant to the uses needs. In this paper, we proposed a new web search personalization approach that captures the user's interest and references in the form of concepts by mining search results and they click through. In this paper an effective mixture personalized re-rank...
متن کاملAn Effective Personalized Search Engine Architecture for Re-ranking Search Results Using User Behavior
Web search engines provide users with a Large number of results for a submitted query. However, not all return results are relevant to the uses needs. In this paper, we proposed a new web search personalization approach that captures the user's interest and references in the form of concepts by mining search results and they click through. In this paper an effective mixture personalized reranki...
متن کامل